Fast anisotropic gauss filtering

Fast Anisotropic Gauss Filtering

We derive the decomposition of the anisotropic Gaussian in a one-dimensional (1-D) Gauss filter in the x-direction followed by a 1-D filter in a nonorthogonal direction phi. So also the anisotropic Gaussian can be decomposed by dimension. This appears to be extremely efficient from a computing perspective. An implementation scheme for normal convolution and for recursive filtering is proposed. ...

Fast Anisotropi Gauss Filtering

The Fast Gauss Transform

Many problems in applied mathematics require the evaluation of the sum of N Gaussians at M points in space. The work required for direct evaluation grows like NM as N and M increase; this makes it very expensive to carry out such calculations on a large scale. In this paper, an algorithm is presented which evaluates the sum of N Gaussians at M arbitrarily distributed points in C. (N + M) work, ...

Anisotropic Channel Filtering

Channel smoothing is an alternative to diffusion filtering for robust estimation of image features. Its main advantages are speed, stability with respect to parameter changes, and a simple implementation. However, channel smoothing becomes instable in certain situations, typically for elongated, periodic patterns like for instance fingerprints. As for the diffusion filtering an anisotropic exte...

Linear Anisotropic Mesh Filtering

No algorithm for unconstrained polygon mesh denoising can beat Laplacian smoothing in simplicity and ease of implementation. In this paper we introduce a new algorithm for polygon meshes smoothing with vertex position and face normal interpolatory constraints composed of two phases. First the face normals are filtered independently of vertex positions. Then the vertex positions are filtered int...